منابع مشابه
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the active constraint gradients are linearly independent and that there are no weakly active constraints. In this paper, we establish a framework for variants of SQP that retain the characteristic superlinear convergence rate ...
متن کاملA Simple SQP Algorithm for Constrained Finite Minimax Problems
A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming. By solving a corresponding quadratic programming, a high-order revised direction is obtained, which can avoid the Maratos effect. Furthermore, under some mild...
متن کاملA Truncated Sqp Algorithm for Large Scale Nonlinear Programming Problems
We consider the inequality constrained nonlinear programming problem and an SQP algorithm for its solution. We are primarily concerned with two aspects of the general procedure, namely, the approximate solution of the quadratic program, and the need for an appropriate merit function. We rst describe an (iterative) interior-point method for the quadratic programming subproblem that, no matter wh...
متن کاملReduced SQP implementation for large-scale optimization problems
The development and implementation of the Range and Null space Decomposition (RND) strategy for large-scale problems is described with emphasis on the optimization of engineering systems. The RND technique, as detailed in Vasantharajan and Biegler (1988), uses nonorthonormal, gradient based projections for the Jacobian. However, this implementation is dense, and does not take advantage of syste...
متن کاملOn a SQP { multigrid technique for nonlinear parabolicboundary control problems
An optimal control problem governed by the heat equation with nonlinear boundary conditions is considered. The objective functional consists of a quadratic terminal part and a quadratic regularization term. It is known, that an SQP method converges quadratically to the optimal solution of the problem. To handle the quadratic optimal control subproblems with high precision, very large scale math...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2002
ISSN: 1052-6234,1095-7189
DOI: 10.1137/s1052623498333731